Dynamic Verification of Sequential Consistency
نویسندگان
چکیده
منابع مشابه
Perfect Sequential Reciprocity and Dynamic Consistency
Dufwenberg and Kirchsteigers (2004) extends Rabins (1993) theory of reciprocity in a dynamic sense, introducing a rule of revision for players beliefs. The Sequential Reciprocity Equilibrium [SRE] they de ne can be dynamically inconsistent. In this article it is argued that such dynamic inconsistency is not intrinsically related to issues of reciprocity, but rather to the particular way the ...
متن کاملTiming verification of sequential dynamic circuits
This paper addresses static timing verification for sequential circuits implemented in a mix of static and dynamic logic. We restrict our focus to regular domino logic and footless domino logic, a variant of domino logic. First we derive constraints for proper operation of dynamic gates. An important observation is that for dynamic gates, input signals may start changing near the end of the eva...
متن کاملDynamic Verification of Memory Consistency in Cache - Coherent Multithreaded Computer
Multithreaded servers with cache-coherent shared memory are the dominant type of machines used to run critical network services and database management systems. To achieve the high availability required for these tasks, it is necessary to incorporate mechanisms for error detection and recovery. Correct operation of the memory system is defined by the memory consistency model. Errors can therefo...
متن کاملComposing ordered sequential consistency
We define ordered sequential consistency (OSC), a generic criterion for concurrent objects. We show that OSC encompasses a range of criteria, from sequential consistency to linearizability, and captures the typical behavior of real-world coordination services, such as ZooKeeper. A straightforward composition of OSC objects is not necessarily OSC, e.g., a composition of sequentially consistent o...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGARCH Computer Architecture News
سال: 2005
ISSN: 0163-5964
DOI: 10.1145/1080695.1070010